#include <bits/stdc++.h>
using namespace std;
class Test{
public:
	vector<int> twoSum(vector<int>& nums, int target) {
		unordered_map<int,int> m;
		vector<int> result;
		for(int i = 0;i < nums.size();i++){
			int dest = target - nums[i];
			if(m.find(dest) != m.end()){
				result.push_back(i);
				result.push_back(m.find(dest)->second);
				return result;
			}else{
				m.insert(pair<int,int>(nums[i],i));
			}
		}
		return {};
	}
};


int main(){
	
	
	return 0;
}
